joint rout schedul multi dhop wireless network direct antenna exploit content redund web inform extract propos extract approach exploit content redund web extract structur data templat base web site start popul seed databas record extract initi site identifi valu page site match attribut valu contain seed set record match attribut valu divers represent site defin similar metric leverag templat structur attribut content specif metric discov match pattern attribut valu site ignor extran portion attribut valu comput similar score filter noisi attribut match exploit fact attribut valu occur fix posit templat base site develop effici apriori style algorithm systemat enumer attribut posit configur suffici match valu page final conduct extens experiment studi real life web data demonstr effect extract approach exploit content redund web inform extract propos extract approach exploit content redund web extract structur data templat base web site start popul seed databas record extract initi site identifi valu page site match attribut valu contain seed set record match attribut valu divers represent site defin similar metric leverag templat structur attribut content specif metric discov match pattern attribut valu site ignor extran portion attribut valu comput similar score filter noisi attribut match exploit fact attribut valu occur fix posit templat base site develop effici apriori style algorithm systemat enumer attribut posit configur suffici match valu page final conduct extens experiment studi real life web data demonstr effect extract approach optim schedul dynam channel alloc wireless lan scalabl content dbase rout pub fsub system multi dqueri optim sketch dbase estim internet research hot search advert cloud comput acceler lookup system peer cach effici aggreg comput data stream mine social network graph detect random link attack effici constraint monitor adapt threshold abstract detect constraint violat larg scale distribut system recent attract plenti attent research commun due vari applic secur network monitor commun effici system critic concern determin practic paper introduc set method call slack scheme implement distribut sum queri effici show analyt empir method lead consider reduct amount commun propos adapt slack scheme adapt chang data distribut scheme lightweight reactiv scheme probabilist adjust local constraint base occurr event period probabl estim conduct extens experiment studi real life synthet data set show slack scheme incur significantli commun overhead compar state art slack scheme save detect anomali end dto dend path measur channel assign mechan rural wireless mesh network villag gatewai node fig rural wireless mesh network abstract paper present channel alloc scheme ieee base mesh network point topoint link design rural area channel alloc scheme continu full duplex data transfer link network requir synchron link channel assign prevent cross link interfer approach simpl link network made direct edg direct edg node assign interf ieee channel set channel assign outgo edg disjoint channel assign incom edg evalu scheme testb demonstr throughput gain significantli end end delai exist link schedul channel alloc protocol design point point mesh network formal speak channel alloc scheme equival edg color problem call direct edg color dec problem establish relationship color problem classic vertex color problem show problem np hard precis give algorithm vertex color graph direct edg color color smallest integ minimum cost topolog construct rural wireless mesh network abstract ieee wifi equip base wireless mesh network recent propos inexpens approach connect flung rural area network built high gain direct antenna establish long distanc wireless point point link node network call gatewai node directli connect wire internet remain node connect gatewai hop domin cost construct mesh network cost construct antenna tower node cost tower depend height turn depend length link physic obstruct link investig problem select link establish node connect cost construct antenna tower requir establish select link minim show problem nphard log approxim expect number vertic graph present algorithm literatur problem provabl perform bound precis present greedi algorithm log approxim algorithm problem final simul compar approxim algorithm optim solut naiv heurist graph summar bound error propos highli compact part represent graph consist graph summari set correct graph summari aggreg graph node correspond set node edg repres edg pair node set hand correct portion specifi list edg correct appli summari recreat represent lossless lossi graph compress bound introduc error combin mdl principl yield highli intuit coars level summari input graph develop algorithm construct highli compress graph represent small size guarante accuraci valid approach extens set experi multipl reallif graph data set knowledg work comput graph summari mdl principl summari correct compress graph bound error regular express index paper describ design architectur lesson learn implement fast regular express index engin free free prebuilt index identifi text data unit match string examin free show order magnitud perform improv case standard regular express match system lex awk grep effici design end dto dend probe sourc drout network configur bgp rout reflector abstract border gatewai protocol bgp standard protocol exchang rout inform border router autonom system as todai internet border router exchang extern learn bgp rout advertis intern bgp bgp peer naiv solut bgp peer session base full mesh topolog simpli scale size modern network carefulli design rout reflector configur drastic reduc total number connect cost requir bgp session principl algorithm approach exist design configur current practic reli manual reflector select simpl ad hoc rule paper address challeng optim problem involv design effect bgp rout reflector configur network specif problem select rout reflector topolog minim total connect cost bgp peer session averag distanc travers rout advertis present hard result establish intract problem propos polynomi time approxim algorithm base lp round combinatori techniqu guarante constant factor logarithm bound qualiti approxim solut simul result valid approach demonstr effect configur algorithm wide rang network topolog optim schedul dynam channel alloc wireless lan villagenet low dcost dbase mesh network rural region abstract villagenet wireless mesh network aim provid low cost broadband internet access rural region cost build network low shelf ieee equip optim network topolog minim cost paper describ oper villagenet discuss fundament problem build network node villagenet commun long distanc pointto point wireless link establish high gain direct antenna villagenet mac protocol suit interfer pattern network protocol requir underli mesh graph channel bi partit channel import consider select bi partit subgraph activ demand node met formal pose problem present initi result observ domin cost construct mesh network cost construct antenna tower node cost tower depend height turn depend length link physic obstruct link minim cost pose problem decid link establish villag connect cost construct antenna tower establish select link minim stream algorithm robust real dtime detect ddo attack effect mechan detect thwart distribut denial servic ddo attack creasingli import success todai internet viabl commerci busi tool earlier work ddo detect problem typic focus line analys ddo attack measur techniqu target small number potenti victim destin mechan detect ddo activ real time larg isp network number packet destin moni tor easili rise million paper propos data stream algorithm robust real time detect ddo activ larg isp network kei element solut hash base synopsi data structur network data stream effici track guarante small space time destin ip address underli network larg respect number distinct sourc ip address establish potenti malici half open connect work address problem effici track top distinct sourc frequenc gener stream updat insert delet set underli network flow enabl effect distinguish ddo activ flash crowd preliminari experiment result verifi effect approach keyword data stream algorithm top frequenc denial servic attack ip network real time system stream algorithm robust real dtime detect ddo attack effect mechan detect thwart distribut denial servic ddo attack creasingli import success todai internet viabl commerci busi tool earlier work ddo detect problem typic focus line analys ddo attack measur techniqu target small number potenti victim destin mechan detect ddo activ real time larg isp network number packet destin moni tor easili rise million paper propos data stream algorithm robust real time detect ddo activ larg isp network kei element solut hash base synopsi data structur network data stream effici track guarante small space time destin ip address underli network larg respect number distinct sourc ip address establish potenti malici half open connect work address problem effici track top distinct sourc frequenc gener stream updat insert delet set underli network flow enabl effect distinguish ddo activ flash crowd preliminari experiment result verifi effect approach keyword data stream algorithm top frequenc denial servic attack ip network real time system effici detect distribut constraint violat distribut environ primari function monitor softwar detect anomali instanc system behavior deviat substanti norm paper propos commun effici scheme anomali detect problem model detect violat global constraint defin distribut system variabl approach elimin continu track global system state decompos global constraint local constraint check effici site occasion event local constraint violat resort expens global constraint check show problem select local constraint base frequenc distribut individu system variabl minim commun cost np hard propos approxim algorithm comput provabl optim term number messag local constraint experiment result real life network traffic data set demonstr techniqu reduc messag commun overhead compar exist data distribut agnost approach diagnos link dlevel anomali passiv probe abstract paper develop passiv network tomographi techniqu infer link level anomali excess loss rate delai path level measur approach involv place passiv monitor devic strateg link network passiv monitor perform network path pass link order monitor infrastructur commun cost low focu minim number passiv probe devic deploi set monitor path mesh topolog show minim problem np hard devis polynomialtim greedi algorithm achiev logarithm approxim factor algorithm tree topolog typic enterpris network show similar np hard result hold constant factor approxim algorithm topolog rout channel alloc rural wireless mesh network villagenet low dcost abstract villagenet wireless mesh network aim provid low cost broadband internet access rural region cost build network low shelf ieee equip optim network topolog minim cost paper describ oper villagenet discuss fundament problem build network node villagenet commun long distanc pointto point wireless link establish high gain direct antenna villagenet mac protocol suit interfer pattern network protocol requir underli mesh graph channel bi partit channel import consider select bi partit subgraph activ demand node met formal pose problem present initi result observ domin cost construct mesh network cost construct antenna tower node cost tower depend height turn depend length link physic obstruct link minim cost pose problem decid link establish villag connect cost construct antenna tower establish select link minim monitor infrastructur converg network servic effici detect distribut constraint violat distribut environ primari function monitor softwar detect anomali instanc system behavior deviat substanti norm paper propos commun effici scheme anomali detect problem model detect violat global constraint defin distribut system variabl approach elimin continu track global system state decompos global constraint local constraint check effici site occasion event local constraint violat resort expens global constraint check show problem select local constraint base frequenc distribut individu system variabl minim commun cost np hard propos approxim algorithm comput provabl optim term number messag local constraint experiment result real life network traffic data set demonstr techniqu reduc messag commun overhead compar exist data distribut agnost approach voip servic qualiti monitor activ passiv probe effici gossip dbase aggreg comput global challeng databas commun join ddistinct aggreg estim updat stream grow interest algorithm process queri continu data stream data fix order limit memori resourc provid approxim answer queri stream crucial requir applic environ exampl includ larg ip network instal perform data part network continu collect analyz abil estim number distinct tupl result join oper correl data stream cardin project duplic elimin join import requir data analysi scenario instanc enabl real time traffic analysi load balanc network monitor applic estim number distinct sourc destin ip address pair occur stream ip packet observ router sourc address packet rout router earlier work present solut individu problem distinct count join size estim duplic elimin stream solut fundament extend combin handl complex join distinct estim problem obviou paper propos space effici algorithm solut gener join distinct estim problem continu data stream techniqu handl gener updat stream compris tupl delet insert estim probabilist natur reli algorithm build combin class hash base synops term jd sketch individu updat stream demonstr algorithm provid low error high confid join distinct estim small space small process time updat fact present lower bound show space usag estim small factor join distinct problem preliminari experiment result verifi effect approach cost dbase model effect heurist repair constraint modif data integr multipl sourc inconsist violat integr constraint constraint repair problem attempt find low cost appli constraint satisfi previou work repair cost state term tupl insert delet follow recent work defin databas repair set modif context introduc cost framework applic techniqu record linkag search good repair prove find minim cost repair model np complet size databas introduc approach heurist repair construct base equival class attribut valu approach defin greedi algorithm simpl algorithm time cubic size databas develop optim inspir algorithm duplic record detect greatli improv scalabl evalu framework algorithm synthet real data show propos optim greatli improv perform cost repair qualiti holist aggreg network world distribut track approxim quantil tradit databas system optim perform shot queri emerg larg scale monitor applic requir continu track complex aggreg data distribut summari collect physic distribut stream effect solut simultan space effici remot site commun effici underli commun network provid continu guaranteedqu estim paper propos algorithm solut problem continu track complex holist aggreg distribut stream set primari focu approxim quantil summari approach broadli applic handl holist aggreg function heavi hitter queri present distribut track scheme maintain accur quantil estim provabl approxim guarante simultan optim storag space remot site commun cost network nutshel algorithm emploi combin local track remot site simpl predict model local site behavior order produc highli commun space effici solut perform extens experi real synthet data explor tradeoff understand role predict model scheme result valid approach reveal signific save naiv solut analyt worst case guarante queri translat xpath sql presenc recurs dtd interact recurs xpath recurs dtd make challeng answer xpath queri xml data store rdbm schema base shred present approach translat xpath queri sql queri simpl fixpoint lfp oper support commerci rdbm approach base algorithm rewrit xpath queri regular xpath express capabl captur dtd recurs xpath queri uniform framework provid algorithm translat regular xpath queri sql queri lfp optim techniqu minim lfp oper oss architectur requir voip network algorithm comput qo path restor grow interest servic provid offer servic qualiti servic qo guaranti resili failur support qo connect requir exist rout mechan comput qo path path satisfi qo constraint delai bandwidth resili failur hand achiev provid primari qo path set altern qo path failur link node object coupl minim global network resourc impli cost primari path restor topolog major consider rout process sketch dbase multi dqueri process data stream abstract recent year wit increas interest design algorithm queri analyz stream data data fix order limit memori provid approxim answer queri continu data stream crucial requir applic environ exampl includ larg telecom ip network instal perform data part network continu collect analyz random techniqu base comput small sketch synops stream recent shown effect tool approxim result singl sql queri stream data tupl paper investig problem aris data stream sketch process multipl queri concurr demonstr presenc multipl queri express intellig share sketch concurr queri evalu result substanti improv util sketch space qualiti result approxim error guarante provid suffici condit multi queri sketch share guarante correct result estim process prove optim sketch share typic rise hard question propos heurist algorithm find good sketch share configur practic result experiment studi realist workload verifi effect approach demonstr benefit sketch share methodolog process data dstream join aggreg skim sketch sganguli mino rastogi abstract grow interest line algorithm analyz queri data stream examin stream element dispos limit amount memori provid approxim answer aggreg queri stream crucial requir applic environ exampl includ larg ip network instal perform data part network continu collect analyz paper present skim sketch algorithm estim join size stream techniqu readili extend join aggreg queri knowledg skim sketch techniqu comprehens join size estim algorithm provid tight error guarante achiev lower bound space requir join size estim method stream environ handl stream gener updat oper insert delet incur low logarithm process time stream element assum priori knowledg frequenc distribut domain valu skim sketch techniqu achiev skim dens frequenc random hash sketch summari stream comput subjoin size involv dens frequenc directli skim sketch approxim subjoin size dens frequenc result experiment studi real life synthet data stream skim sketch algorithm significantli accur estim join size compar earlier sketch base techniqu distribut set express cardin estim problem estim set express cardin distribut stream environ rapid updat stream origin remot site continu transmit central process system walru similar retriev algorithm imag databas topolog discoveri heterogen ip network netinventori system travel pez dispens rout issu mpl algorithm comput qo path restor grow interest servic provid offer servic qualiti servic qo guaranti resili failur support qo connect requir exist rout mechan comput qo path path satisfi qo constraint delai bandwidth resili failur hand achiev provid primari qo path set altern qo path failur link node object coupl minim global network resourc impli cost primari path restor topolog major consider rout process optim configur bgp rout select internet servic provid provid transit servic traffic custom provid time attempt minim network util balanc traffic capac border router central select border router transit traffic flow border gatewai protocol bgp autonom system peer rout advertis network prefix determin select border router traffic flow physic topolog discoveri larg multi dsubnet network knowledg date physic layer topolog ethernet network crucial number critic network manag task includ reactiv proactiv resourc manag event correl root analysi dynam natur todai ip network keep track topolog inform manual daunt imposs task effect algorithm automat discov physic network topolog paper propos complet algorithm solut discov physic topolog larg heterogen ethernet network compris multipl subnet possibl dumb uncoop network element algorithm reli standard snmp mib inform wide support modern ip network requir modif oper system softwar run element host formal demonstr solut complet mib data mib inform suffici uniqu identifi network topolog algorithm guarante recov knowledg solut provid strong complet guarante robust monitor link delai fault ip network paper develop failur resili techniqu monitor link delai fault servic provid enterpris ip network phase approach attempt minim monitor infrastructur cost addit traffic due probe messag phase approach comput locat minim set monitor station network link cover presenc link failur subsequ phase comput minim set probe messag transmit station measur link delai isol network fault show station select problem probe assign problem np hard propos greedi approxim algorithm achiev logarithm approxim factor station select problem constant factor probe assign problem approxim ratio provabl close bound algorithm process set express continu updat stream captur type constraint data integr propos framework integr data multipl relat sourc xml document conform dtd satisfi predefin xml constraint framework base specif languag aig extend dtd associ element type semant attribut inherit synthes inspir notion attribut grammar comput attribut parameter sql queri multipl data sourc incorpor xml kei inclus constraint novelti aig consist semant attribut depend relat control context depend dtd direct construct xml document check xml constraint parallel document gener present cost base optim techniqu effici evalu aig includ algorithm merg queri schedul queri multipl data sourc grammar base approach data integr syntact semant constraint techniqu cluster massiv data set xtract learn document type descriptor xml document collect build decis tree constraint dtd infer xml document xtract approach xml rapidli emerg standard data represent exchang web document type descriptor dtd valuabl inform structur xml document crucial role effici storag queri xml data import dtd mandatori document xml databas accompani dtd paper present overview xtract system infer dtd schema databas xml document dtd syntax incorpor full express power regular express naiv approach typic fail produc concis intuit dtd xtract infer algorithm emploi sequenc sophist step involv find pattern input sequenc replac regular express gener gener candid dtd factor candid dtd adapt algorithm logic optim literatur appli minimum descript length mdl principl find dtd candid scalabl filter xml data web servic advent xml de facto languag data interchang rapid emerg web servic web applic deal increas amount xml tra soap request order scale larg number client high data tra back end system web servic map face challeng task cientli filter classifi rout incom xml request compon infrastructur destin xml request depend actual type content web servic applic incorpor highli cient content base rout technolog paper address issu scalabl filter xml data describ sophist techniqu match data larg number tree structur filter express xpath languag propos hierarch xml rout architectur support extrem high load present experiment result demonstr perform mine optim gain rule numer attribut associ rule determin correl attribut relat applic market nancial retail sector optim associ rule ectiv focu interest characterist involv attribut optim associ rule permit uninstanti attribut problem determin instanti support con denc gain rule maxim paper gener optim gain associ rule problem permit rule disjunct uninstanti numer attribut gener associ rule enabl extract inform season local pattern involv uninstanti attribut rule singl numer attribut present algorithm linear complex comput optim gain rule propos bucket techniqu result signi reduct input size coalesc contigu valu sacri cing optim present approxim algorithm base dynam program numer attribut recent result binari space partit tree show approxim constant factor optim optim gain rule experiment result synthet data set singl numer attribut demonstr algorithm scale linearli attribut domain size number disjunct addit show appli optim rule framework popul survei real life data set enabl discov interest underli correl attribut guest editor introduct special section onlin analysi queri continu data stream detect recoveri techniqu databas corrupt optim configur ospf aggreg abstract open shortest path ospf popular protocol rout autonom system domain order scale larg network hundr thousand subnet ospf support level hierarch rout scheme ospf area subnet address area aggreg aggreg crucial requir scale ospf larg domain result signific reduct rout tabl size smaller link state databas network traffic synchron router link state databas hand address aggreg impli loss inform length shortest path subnet turn lead suboptim rout paper address import practic problem configur ospf aggreg minim error ospf shortest path comput due subnet aggreg develop optim dynam program algorithm upper bound number aggreg advertis weight assign function aggreg comput aggreg result minimum cumul error shortest path comput sourc destin subnet pair subsequ tackl problem assign weight ospf aggreg cumul error comput shortest path minim demonstr special case unweight cumul error effici optim algorithm weightassign problem devis gener problem hard reli search heurist solv weightassign problem knowledg work address algorithm issu underli configur ospf aggreg propos effici configur algorithm provabl optim practic scenario dtree effici index structur regular express abstract due express power regular express re quickli integr part languag specif import applic scenario applic manag huge databas specif provid effect match mechan input string quickli identifi re databas match paper propos tree index structur larg databas specif input queri string tree speed retriev match re focus search compar input string small fraction re databas tree similar spirit tree base structur propos index multidimension data index significantli challeng re typic repres infinit set string defin notion spatial local address challeng tree index structur reli measur compar rel size infinit regular languag propos innov solut tree oper includ effect split tree node comput tight bound collect re final demonstr samplingbas approxim algorithm significantli speed perform tree oper preliminari experiment result moder larg synthet data set tree effect prune search space easili outperform naiv sequenti search approach optim configur ospf aggreg abstract open shortest path ospf popular protocol rout autonom system domain order scale larg network hundr thousand subnet ospf support level hierarch rout scheme ospf area subnet address area aggreg aggreg crucial requir scale ospf larg domain result signific reduct rout tabl size smaller link state databas network traffic synchron router link state databas hand address aggreg impli loss inform length shortest path subnet turn lead suboptim rout paper address import practic problem configur ospf aggreg minim error ospf shortest path comput due subnet aggreg develop optim dynam program algorithm upper bound number aggreg advertis weight assign function aggreg comput aggreg result minimum cumul error shortest path comput sourc destin subnet pair subsequ tackl problem assign weight ospf aggreg cumul error comput shortest path minim demonstr special case unweight cumul error effici optim algorithm weightassign problem devis gener problem hard reli search heurist solv weightassign problem knowledg work address algorithm issu underli configur ospf aggreg propos effici configur algorithm provabl optim practic scenario restor algorithm virtual privat network hose model virtual privat network vpn aim emul servic provid privat network share internet endpoint vpn connect abstract virtual channel vc atm label switch path lsp mpl technolog reliabl end end vpn connect depend reliabl link node fix path travers network order ensur servic qualiti avail vpn seamless recoveri failur essenti work consid problem fast recoveri recent propos vpn hose model hose model bandwidth reserv traffic aggreg pairwis specif traffic pattern vpn endpoint work assum vpn endpoint connect tree structur time tree link fail singl link failur model restor algorithm select asetofbackup edg alloc bandwidth advanc traffic disrupt failur primari edg rout backup path aim design optim restor algorithm minim total bandwidth reserv backup edg problem variant optim graph augment problem np complet present polynomi time approxim algorithm guarante solut time optimum algorithm base design reduct convert origin problem ad minimum cost edg vpn tree result graph connect solv polynomi time algorithm reduct introduc approxim factor result appro network data mine analysi nemesi project modern commun network gener larg amount oper data includ traffic util statist alarm fault data level detail massiv collect network manag data grow order terabyt year typic hide knowledg crucial kei task involv effect manag commun network capac plan traffic engin short paper provid overview recent ongo work context project bell laboratori aim develop data wareh mine technolog effect storag explor analysi massiv network manag data set give highlight work model base semant compress mbsc data compress framework take advantag attribut semant data mine model perform lossi compress massiv network data tabl discuss architectur kei algorithm underli model base semant compress system exploit predict data correl prescrib error toler individu attribut construct concis accur classif regress tree cart model entir column tabl summar ongo work wareh analyz network fault data discuss vision data mine techniqu emploi autom improv faultmanag modern commun network specif describ kei compon modern fault manag architectur event correl root analysi engin propos process complex aggreg queri data stream recent year wit increas interest design algorithm queri analyz stream data data fix order limit memori provid approxim answer queri continu data stream crucial requir applic environ exampl includ larg telecom ip network instal perform data part network continu collect analyz queri mine data stream tutori dtree effici index structur regular express abstract due express power regular express re quickli integr part languag specif import applic scenario applic manag huge databas specif provid effect match mechan input string quickli identifi re databas match paper propos tree index structur larg databas specif input queri string tree speed retriev match re focus search compar input string small fraction re databas tree similar spirit tree base structur propos index multidimension data index significantli challeng re typic repres infinit set string defin notion spatial local address challeng tree index structur reli measur compar rel size infinit regular languag propos innov solut tree oper includ effect split tree node comput tight bound collect re final demonstr samplingbas approxim algorithm significantli speed perform tree oper preliminari experiment result moder larg synthet data set tree effect prune search space easili outperform naiv sequenti search approach tree pattern aggreg scalabl xml data dissemin rapid growth xml document traffic internet scalabl content base dissemin xml document larg dynam group consum import research challeng type content interest data consum typic subscript xml pattern specif languag xpath dtd ddirect publish attribut translat grammar present framework publish relat data xml respect fix dtd data exchang web xml view relat data typic requir conform predefin dtd presenc recurs dtd determin make challeng gener dtd direct effici transform mine optim associ rule categor numer attribut associ rule determin correl attribut relat applic market financi retail sector optim associ rule effect focu interest characterist involv attribut optim associ rule permit uninstanti attribut problem determin instanti support confid rule maxim paper gener optim associ rule problem wai associ rule allow disjunct uninstanti attribut associ rule permit arbitrari number uninstanti attribut uninstanti attribut categor numer gener associ rule enabl extract inform season local pattern involv multipl attribut present effect mine sequenti pattern regular express constraint kaist lambda aitrci kusong dong yusong gu algorithm provis virtual privat network hose model virtual privat network vpn provid custom predict secur network connect share network recent propos hose model vpn greater flexibl permit traffic hose endpoint arbitrarili distribut endpoint paper develop algorithm provis vpn hose model connect vpn endpoint tree structur algorithm attempt optim total bandwidth reserv edg vpn tree show simpl scenario network link assum infinit capac gener problem comput optim vpn tree np hard fortun special case ingress egress bandwidth vpn endpoint equal devis algorithm comput optim tree time complex mn number link node network present integ program formul gener vpn tree comput problem ingress egress bandwidth vpn endpoint arbitrari develop algorithm base primal dual method final extend propos algorithm comput vpn tree case network link capac constraint show presenc link capac constraint comput optim vpn tree np hard ingress egress bandwidth endpoint equal experiment result synthet network graph vpn tree construct propos algorithm dramat reduc bandwidth requir instanc factor compar scenario steiner tree emploi connect vpn endpoint spartan constrain model guarante derror semant compress effici filter xml document xpath express cychan pascal mino rastogi propos index structur term xtrie support effici filter xml document base xpath express xtrie index structur offer featur make attract largescal publish subscrib system xtrie design support effect filter base complex xpath express oppos simpl singl path specif xtrie structur algorithm design support order unord match xml data index sequenc element name organ trie structur sophist match algorithm xtrie reduc number unnecessari index probe avoid redund match provid extrem effici filter experiment result wide rang xml document xpath express workload demonstr xtrie index structur outperform earlier approach wide margin data mine meet network manag nemesi project modern commun network gener larg amount oper data includ traffic util statist alarm fault data level detail massiv collect network manag data grow order terabyt year typic hide knowledg crucial kei task involv effect manag commun network capac plan traffic engin short paper provid overview recent ongo work context nemesi project bell laboratori aim develop data wareh mine technolog effect storag explor analysi massiv network manag data set give highlight work model base semant compress mbsc data compress framework take advantag attribut semant data mine model perform lossi compress massiv network data tabl discuss architectur kei algorithm underli spartan model base semant compress system exploit predict data correl prescrib error toler individu attribut construct concis accur classif regress tree cart model entir column tabl summar ongo work wareh analyz network fault data discuss vision data mine techniqu emploi autom improv fault manag modern commun network specif describ kei compon modern fault manag architectur event correl root analysi engin propos mine idea autom travel pez dispens rout issu mpl effici monitor bandwidth latenc ip network abstract effect monitor network util perform indic kei enabl technolog proactiv reactiv resourc manag flexibl account intellig plan nextgener ip network paper address challeng problem effici monitor bandwidth util path latenc ip data network unlik earlier approach measur architectur assum singl point control network network oper center respons gather bandwidth latenc inform wide deploi manag tool snmp rmon netflow explicitli rout ip probe packet goal identifi effect techniqu monitor bandwidth usag set link packet flow path latenc set path minim overhead impos manag tool underli product network demonstr minim overhead measur model rise combinatori optim problem prove hard propos approxim algorithm optim problem prove guarante upper bound worst case perform simul result valid approach demonstr effect monitor algorithm wide rang network topolog effici monitor bandwidth latenc ip network abstract effect monitor network util perform indic kei enabl technolog proactiv reactiv resourc manag flexibl account intellig plan nextgener ip network paper address challeng problem effici monitor bandwidth util path latenc ip data network unlik earlier approach measur architectur assum singl point control network network oper center respons gather bandwidth latenc inform wide deploi manag tool snmp rmon netflow explicitli rout ip probe packet goal identifi effect techniqu monitor bandwidth usag set link packet flow path latenc set path minim overhead impos manag tool underli product network demonstr minim overhead measur model rise combinatori optim problem prove hard propos approxim algorithm optim problem prove guarante upper bound worst case perform simul result valid approach demonstr effect monitor algorithm wide rang network topolog algorithm provis virtual privat network hose model virtual privat network vpn provid custom predict secur network connect share network recent propos hose model vpn greater flexibl permit traffic hose endpoint arbitrarili distribut endpoint paper develop algorithm provis vpn hose model connect vpn endpoint tree structur algorithm attempt optim total bandwidth reserv edg vpn tree show simpl scenario network link assum infinit capac gener problem comput optim vpn tree np hard fortun special case ingress egress bandwidth vpn endpoint equal devis algorithm comput optim tree time complex mn number link node network present integ program formul gener vpn tree comput problem ingress egress bandwidth vpn endpoint arbitrari develop algorithm base primal dual method final extend propos algorithm comput vpn tree case network link capac constraint show presenc link capac constraint comput optim vpn tree np hard ingress egress bandwidth endpoint equal experiment result synthet network graph vpn tree construct propos algorithm dramat reduc bandwidth requir instanc factor compar scenario steiner tree emploi connect vpn endpoint main dmemori index structur fix dsize partial kei independ good depend dbase histogram synops high ddimension data approxim joint data distribut multi dimension data set compact accur histogram synopsi fundament problem aris numer practic scenario includ queri optim approxim queri answer exist solut reli simplist independ assumpt directli approxim full joint data distribut complet set attribut approach doom fail high dimension data set complex correl pattern attribut paper propos approach histogram base synops emploi solid foundat statist interact model explicitli identifi exploit statist characterist data abstractli kei idea break synopsi statist interact model accur captur signific correl independ pattern data collect histogram low dimension margin base model provid accur approxim joint data distribut extens experiment result real life data set verifi effect approach import aspect gener model base methodolog enhanc perform synopsi techniqu base data space partit wavelet provid effect tool deal dimension curs spartan model dbase semant compress system massiv data tabl provis virtual privat network network design problem multicommod flow set group node situat larg underli network wish reserv bandwidth support commun virtual privat network vpn servic support construct build physic network group node connect bandwidth underli network reserv commun group form virtual network provis virtual privat network set termin rise gener network design problem bound cumul amount traffic termin send receiv choos path pair termin bandwidth alloc edg network traffic matrix consist upper bound feasibl rout seek design network support continuum traffic scenario provid optim approxim algorithm variant problem depend traffic matrix requir symmetr design network requir tree natur constraint number basic applic establish relat collect network design problem variant facil locat problem introduc karger minkoff extend result provid stronger approxim algorithm problem semant knowledg distribut object increas reliabl avail system distribut complex ensur consist execut maxim avail distribut applic mechan replic load balanc data cach protocol consist manag compon avail tradition instanti applic distribut object base environ corba java rmi infrastructur determin adequ protocol guarante live safeti base request semant knowledg applic paper discuss semant knowledg distribut object implement intellig behavior middlewar choos optim protocol distribut compon interact overcom heterogen autonomi multidatabas system cure effici cluster algorithm larg databas discov commun graph structur web interest research problem recent paper compar state art author detect graph partit method propos concentr circl model accur defin commun model commun set concentr circl import object repres concept commun lie center call core object affili object relat core object surround core rank base concentr circl model algorithm develop discov commun conform model conduct case studi automat discov research interest group comput scienc domain web experi show method effect gener high qualiti commun clear structur tunabl granular mine optim support rule numer attribut paper gener optim support associ rule problem permit rule disjunct uninstanti numer attribut rule singl numer attribut present dynam program algorithm comput optim associ rule propos bucket techniqu reduc input size divid conquer strategi improv perform significantli sacrif optim experiment result singl numer attribut bucket divid conquer enhanc effect reduc execut time memori requir dynam program algorithm show algorithm scale linearli attribut domain size number disjunct introduct associ rule introduc ai provid mechan discov correl underli data reminisc influenti paper approxim queri process wavelet abstract approxim queri process emerg cost effect approach deal huge data volum stringent respons time requir todai decis support system dss work area limit queri process scope typic focus specif form aggreg queri convent approach base sampl histogram inher limit approxim result complex queri high dimension dss data set paper propos multi dimension wavelet effect tool gener purpos approxim queri process modern high dimension applic approach base build wavelet coeffici synops data synops provid approxim answer queri develop queri process topolog discoveri heterogen ip network abstract knowledg date physic topolog ip network crucial number critic network manag task includ reactiv proactiv resourc manag event correl root analysi dynam natur todai ip network keep track topolog inform manual daunt imposs task effect algorithm automat discov physic network topolog earlier work typic concentr discov logic layer topolog impli connect layer element switch bridg proprietari solut target specif product famili paper present algorithm discov physic topolog heterogen multi vendor ip network algorithm reli standard snmp mib inform wide support modern ip network element requir modif oper system softwar run element host implement algorithm present paper context topolog discoveri tool test lucent research network experiment result valid approach demonstr tool consist discov accur physic network topolog time roughli quadrat number network element effici algorithm construct decis tree constraint classif import problem data mine number popular classifi construct decis tree gener class model frequent construct tree complex hundr node difficult comprehend fact call question oftencit benefit decis tree easi interpret paper address problem construct simpl decis tree node easi human interpret permit user constraint tree size accuraci build tree satisfi constraint ensur final tree easi understand good accuraci develop branch bound algorithm push constraint build phase classifi prune earli tree node possibl satisfi constraint experiment result real life synthet data set demonstr signific perform speedup xtract system extract document type descriptor xml document effici algorithm mine outlier larg data set paper propos formul distanc base outlier base distanc point nearest neighbor rank point basi distanc nearest neighbor declar top point rank outlier addit develop straightforward solut find outlier base classic nestedloop join index join algorithm develop highli effici partit base algorithm mine outlier algorithm partit input data set disjoint subset prune entir partit determin outlier result substanti save comput present result extens experiment studi real life synthet data set result real life nba databas highlight reveal expect unexpect aspect databas result studi synthet data set demonstr partit base algorithm scale respect data set size data set dimension dline reorgan object databas approxim queri process wavelet abstract approxim queri process emerg cost effect approach deal huge data volum stringent respons time requir todai decis support system dss work area limit queri process scope typic focus specif form aggreg queri convent approach base sampl histogram inher limit approxim result complex queri high dimension dss data set paper propos multi dimension wavelet effect tool gener purpos approxim queri process modern high dimension applic approach base build wavelet coeffici synops data synops provid approxim answer queri develop queri process public decis tree classifi integr build prune classif import problem data mine databas record class label classifi gener concis meaning descript class classifi subsequ record number popular classifi construct decis tree gener class model classifi build decis tree prune subtre decis tree subsequ prune phase improv accuraci prevent overfit gener decis tree distinct phase result substanti amount wast effort entir subtre construct phase prune phase paper propos public improv decis tree classifi integr prune phase initi build phase public node expand build phase determin prune subsequ prune phase order ma rock robust cluster algorithm categor attribut cluster data mine discov distribut pattern underli data cluster algorithm emploi distanc metric base euclidean similar measur order partit databas data point partit similar point partit paper studi cluster algorithm data boolean categor attribut show tradit cluster algorithm distanc point cluster boolean categor attribut propos concept link measur similar proxim pair data point develop robust hierarch cluster algorithm rock emploi link distanc merg cluster improv predict transact execut time real dtime databas workshop report acm sigmod workshop research issu data mine knowledg discoveri scalabl data mine model constraint mine optim support rule numer attribut paper gener optim support associ rule problem permit rule disjunct uninstanti numer attribut rule singl numer attribut present dynam program algorithm comput optim associ rule propos bucket techniqu reduc input size divid conquer strategi improv perform significantli sacrif optim experiment result singl numer attribut bucket divid conquer enhanc effect reduc execut time memori requir dynam program algorithm show algorithm scale linearli attribut domain size number disjunct introduct associ rule introduc ai provid mechan discov correl underli data codeword protect databas data class softwar error increasingli extens perform specialpurpos applic code integr databas system code applic code direct access databas system buffer result danger data corrupt due inadvert applic write increas previous propos hardwar techniqu protect corrupt requir system call perform depend detail hardwar architectur investig altern approach codeword region data detect corrupt prevent corrupt data subsequ transact develop techniqu vari level protect space overhead perform impact concurr techniqu implement dal main memori storag manag perform impact normal process evalu techniqu develop recov transact read corrupt data caus bad write write data databas techniqu limit low cost log transact read trace corrupt prove resolv problem caus incorrect data entri logic error rock robust cluster algorithm categor attribut cluster data mine discov distribut pattern underli data cluster algorithm emploi distanc metric base euclidean similar measur order partit databas data point partit similar point partit paper studi cluster algorithm data boolean categor attribut show tradit cluster algorithm distanc point cluster boolean categor attribut propos concept link measur similar proxim pair data point develop robust hierarch cluster algorithm rock emploi link distanc merg cluster schedul data replic improv tape jukebox perform mine optim gain rule numer attribut associ rule determin correl attribut relat applic market nancial retail sector optim associ rule ectiv focu interest characterist involv attribut optim associ rule permit uninstanti attribut problem determin instanti support con denc gain rule maxim paper gener optim gain associ rule problem permit rule disjunct uninstanti numer attribut gener associ rule enabl extract inform season local pattern involv uninstanti attribut rule singl numer attribut present algorithm linear complex comput optim gain rule propos bucket techniqu result signi reduct input size coalesc contigu valu sacri cing optim present approxim algorithm base dynam program numer attribut recent result binari space partit tree show approxim constant factor optim optim gain rule experiment result synthet data set singl numer attribut demonstr algorithm scale linearli attribut domain size number disjunct addit show appli optim rule framework popul survei real life data set enabl discov interest underli correl attribut scalabl algorithm mine larg databas method effici mine frequent pattern studi extens research previous propos method encount perform bottleneck mine databas data characterist dens spars long short pattern memori base disk base walru similar retriev algorithm imag databas crawler portal mice men mine web panel datablitz storag manag main memori databas perform critic applic gener purpos commerci disk base databas system wide emploi practic fail meet perform requir applic requir short predict respons time extrem updat propag protocol replic databas spirit sequenti pattern mine regular express constraint discov sequenti pattern import problem data mine host applic domain includ medicin telecommun world wide web convent spirit sequenti pattern mine regular express constraint discov sequenti pattern import problem data mine host applic domain includ medicin telecommun world wide web convent data mine web past present futur mine optim associ rule categor numer attribut associ rule determin correl attribut relat applic market financi retail sector optim associ rule effect focu interest characterist involv attribut optim associ rule permit uninstanti attribut problem determin instanti support confid rule maxim paper gener optim associ rule problem wai associ rule allow disjunct uninstanti attribut associ rule permit arbitrari number uninstanti attribut uninstanti attribut categor numer gener associ rule enabl extract inform season local pattern involv multipl attribut present effect cure effici cluster algorithm larg databas discov commun graph structur web interest research problem recent paper compar state art author detect graph partit method propos concentr circl model accur defin commun model commun set concentr circl import object repres concept commun lie center call core object affili object relat core object surround core rank base concentr circl model algorithm develop discov commun conform model conduct case studi automat discov research interest group comput scienc domain web experi show method effect gener high qualiti commun clear structur tunabl granular public decis tree classifi integr build prune classif import problem data mine databas record class label classifi gener concis meaning descript class classifi subsequ record number popular classifi construct decis tree gener class model classifi build decis tree prune subtre decis tree subsequ prune phase improv accuraci prevent overfit gener decis tree distinct phase result substanti amount wast effort entir subtre construct phase prune phase paper propos public improv decis tree classifi integr prune phase initi build phase public node expand build phase determin prune subsequ prune phase order ma datablitz high perform main dmemori storag manag ensur consist multidatabas preserv dlevel serializ concept serializ tradition accept correct criterion databas system multidatabas system mdbss ensur global serializ di cult task di culti aris due heterogen concurr control protocol particip local databas manag system dbmss desir preserv autonomi local dbmss gener solut global serializ problem result execut low degre concurr altern relax serializ result data inconsist paper introduc systemat approach relax serializ requir mdb environ approach exploit structur integr constraint natur transact program ensur consist requir execut serializ develop simpl power classi cation mdbss base natur integr constraint transact program oftheidenti ed model showhow consist preserv ensur execut level serializ lsr lsr correct criterion mdb environ weaker serializ make approach interest unlik global serializ ensur lsr mdb environ simpl protocol ensur lsr permit high degre concurr rang model cover practic mdb environ result paper appli preserv databas consist distribut multi dlevel recoveri main dmemori databas correct nonserializ execut period retriev video disk arrai multimedia support databas logic physic version main memori databas present design multi version concurr control recoveri main memori databas describ logic physic version scheme read transact execut obtain data item lock system latch scheme enabl system guarante updat interfer read transact read transact delai long oper system suffici cycl contribut includ space save techniqu main memori implement extend tree index structur design main memori databas support concurr access latch free travers demonstr perform benefit extens scheme implement wide softwar platform bell lab full scheme implement dal main memori storag manag introduct disk base databas exhibit improv pe architectur dal ed main dmemori storag manag ion dal architectur illustr figur organ multipl layer abstract support toolkit approach discuss earlier highest level user interact dal relat manag level call heap file index layer support fix length variabl length collect templat base lock log system databas databas file databas file databas file process user code dal librari virtual memori process virtual memori process system physic memori process user code dal librari log updat databas checkpoint imag databas figur architectur dal system bell labstechn journal uwint index abstract gener level user interact individu lock latch latchi short term lock implement high speed mutual exclus mechan user specifi architectur issu multimedia storag system fine dgranular lock client dbase log distribut architectur present algorithm fine granular lock client base log transact facil distribut client server architectur provid local multipl client allow concurr modifi object page synchron updat client log disk log record updat local cach data written transact rollback client crash recoveri handl exclus client local log merg time client checkpoint independ client clock synchron client dbase log high perform distribut architectur paper propos log recoveri algorithm distribut architectur local disk space provid transact facil local node log file log record updat local cach page written transact rollback node crash recoveri handl exclus node log file merg time algorithm requir form time synchron node node checkpoint independ final algorithm make paradigm distribut transact manag potenti exploit resourc improv scalabl perform introduct prolifer inexpens workstat network creat era distribut comput time tradit applic comput aid design cad comput aid softwar engin case geograph inform system gi buffer replac algorithm multimedia storag system disk stripe video server environ distribut multi dlevel recoveri main dmemori databas fault dtoler architectur continu media server continu media server provid support storag retriev continu media data video audio guarante rate increasingli import server typic reli disk servic larg number client highli suscept disk failur develop fault toler approach reli admiss control order meet rate guarante continu media request scheme enabl data retriev disk requir rate disk fail approach present data placement strategi admiss control algorithm present design techniqu maxim number client support continu media server final extens simul demonstr effect scheme introduct rapid advanc comput commun technolog fuel explos growth multimedia indu storag retriev continu media data continu media applic requir guarante transfer rate data integr part daili comput life convent le system provid rate guarante suitabl storag retriev continu media data audio video meet demand applic continu media le system provid rate guarante manag critic storag resourc memori disk design paper highlight issu storag retriev continu media data rst present simpl scheme concurr retriev multipl continu media stream disk introduc clever alloc techniqu store continu media data elimin disk latenc drastic reduc ram requir present video data scheme implement oper fast forward rewind paus final conclud outlin direct futur research storag retriev continu media data framework storag retriev contin media data design low dcost video don ddemand storag system recent advanc storag technolog coupl dramat increas bandwidth network make provid video demand servic viewer video demand server comput system store video compress digit form support portion compress video data access transmit concurr paper present low cost storag architectur video demand server reli princip disk high bandwidth disk conjunct clever strategi stripe video util order enabl simultan access transmiss portion video separ fix time interv present wide rang scheme implement vcr function includ fast forward rewind paus final extend scheme case video rate requir exploit transact semant multidatabas system serializ tradition accept notion correct databas system multidatabas system mdb environ consist pre exist autonom databas system requir schedul serializ sever hurt perform number instanc semant transact exploit order permit serializ execut paper propos power simpl mechan mdb environ set serializ execut unaccept undesir interleav transact regular express transact type mechan facilit develop effici graph base scheme ensur concurr execut transact mdb environ meet specif examin trade complex degre concurr permit scheme framework storag retriev contin media data research issu multimedia storag server paper discuss major research problem work part fellini multimedia storag server project amp bell lab disk storag issu disk stripe video server environ disk dbase storag architectur movi demand server recent advanc storag technolog effect store video digit compress form coupl recent dramat increas bandwidth network make provid viewer movi demand elimin inflex inher todai broadcast cabl system movi demand mod server comput system store movi compress digit form support portion compress movi data access transmit concurr server enabl viewer watch movi time desir enabl appli vcr oper paus resum fast forward rewind movi watch paper present disk base storag architectur mod server present clever strategi stripe movi enabl simultan access transmiss portion movi present wide rang scheme implement vcr function includ fast forward rewind paus enhanc pre dexist data manag atom durabl storag retriev continu media data continu media applic requir guarante transfer rate data integr part daili comput life convent le system provid rate guarante suitabl storag retriev continu media data audio video meet demand applic continu media le system provid rate guarante manag critic storag resourc memori disk design paper highlight issu storag retriev continu media data rst present simpl scheme concurr retriev multipl continu media stream disk introduc clever alloc techniqu store continu media data elimin disk latenc drastic reduc ram requir present video data scheme implement oper fast forward rewind paus final conclud outlin direct futur research storag retriev continu media data dal ed high perform main memori storag manag perform databas appli cation dictat entir databas store main memori dali system main memori storag manag design provid persist avail safeti guarante typic expect disk resid databas time pro vide high perform virtu ing tune support memori data dali philosophi treat data clude system data uniformli databas file memori map directli access updat user process direct access high perform slower secur access provid server process featur dali tailor ap plicat achiev high perform concurr control log turn desir enabl dali effici support applic quir persist memori resid data share multipl process object orient relat databas im plement top dali permisrion io copi wiihoui fee ot pari materi ir grani provid thai copi made diriribui direci cornmeni advantag vldb copyright notic titl public ii dale appeur notic ia thaf copi ir pennirrion larg data bare endow copi otherwir republish requir fee special pennirrion endow low dcost storag server movi demand databas recent advanc storag network technolog provid movi demand mod servic elimin inflex inher todai broadcast cabl system mod server comput system store movi compress digit form support portion compress movi data access transmit concurr paper present low cost storag architectur mod server reli princip disk high bandwidth disk conjunct clever strategi stripe movi util order enabl simultan access transmiss portion movi present wide rang scheme implement vcr function effici global transact manag multidatabas system correct dserializ execut number applic environ comput aid design serializ tradition accept notion correct found restrict number altern criteria propos literatur criterion predic wise serializ pwsr requir restrict schedul access subset databas integr constraint defin serializ paper identifi restrict structur transact program concurr execut access characterist pwsr schedul preserv databas consist transcend serializ requir real world applic bank imprecis data matter fact classic databas manag system provid manag imprecis data appli method interv arithmet epsilon serializ relat area applic design manag natur imprecis data approach includ oper imprecis data give bound result imprecis algorithm constrain imprecis propag databas introduct tradit databas manag system provid support precis data physic world data imprecis import class exampl scientif data incomplet record data instrument nois measur error comput model imprecis data aggreg kind fuzzi data manag epsilon serializ algorithm pl dp transact model multidatabas system quarterli bulletin ensur transact atom multidatabas system relax serializ multidatabas system concurr control problem multidatabas characterist solut site pl protocol function map transact oper execut time obtain lock time releas lock serial function proof ser function map transact oper execut time obtain lock time releas lock show pair transact serial ser oe lt dserializ execut heterogen distribut databas system 